Data Flow Analysis of Recursive

Most imperative languages only ooer arrays as \\rst-class" data structures. Other data structures, especially recursive data structures such as trees, have to be manipulated using explicit control of memory, i.e., through pointers to explicitly allocated portions of memory. We believe that this severe limitation is mainly due to historical reasons, and this paper will try and demonstrate that modern analysis techniques, such as data ow analysis, allow to cope with the compilation problems associated with recursive data structures. As a matter of fact, recursion in the ow of control also is a current open issue in automatic parallelization: to our knowledge, no theory allows the parallelization of, e.g., recursive Pascal programs. This paper uniformly handles both issues. We propose a kernel language that manipulates recursive data structures in an elegant, algebraic way. In this preliminary work, both data-and control-recursive structures are restricted, so that a data ow analysis is possible. Departing from classical frameworks in automatic parallelization, our framework not only relies on integer linear programming but also on language theory.